Propositional Simplification With BDDs and SAT Solvers
نویسنده
چکیده
We show how LCF-style interactive theorem provers might use BDD engines and SAT solvers to perform normalization, simplification of terms and theorems, and assist with interactive proof. The treatment builds on recent work integrating SAT solvers as non-trusted decision procedures for LCF-style theorem provers. We limit ourselves to propositional logic, but briefly note that the results may be lifted to more expressive logics.
منابع مشابه
Function-Complete Lookahead in Support of Efficient SAT Search Heuristics
Recent work has shown the value of using propositional SAT solvers, as opposed to pure BDD solvers, for solving many real-world Boolean Satisfiability problems including Bounded Model Checking problems (BMC). We propose a SAT solver paradigm which combines the use of BDDs and search methods to support efficient implementation of complex search heuristics and effective use of early (preprocessor...
متن کاملSymbolic Reachability Analysisbased on SAT -
The introduction of symbolic model checking using Binary Decision Diagrams (BDDs) has led to a substantial extension of the class of systems that can be algorithmically veriied. Although BDDs have played a crucial role in this success, they have some well-known drawbacks, such as requiring an externally supplied variable ordering and causing space blowups in certain applications. In a parallel ...
متن کاملGeneric CDCL - A Formalization of Modern Propositional Satisfiability Solvers
Modern propositional satisfiability (or SAT) solvers are very powerful due to recent developments on the underlying data structures, the used heuristics to guide the search, the deduction techniques to infer knowledge, and the formula simplification techniques that are used during preand inprocessing. However, when all these techniques are put together, the soundness of the combined algorithm i...
متن کاملSatisfiability-Based Methods for Reactive Synthesis from Safety Specifications
Existing approaches to synthesize reactive systems from declarative specifications mostly rely on Binary Decision Diagrams (BDDs), inheriting their scalability issues. We present novel algorithms for safety specifications that use decision procedures for propositional formulas (SAT solvers), Quantified Boolean Formulas (QBF solvers), or Effectively Propositional Logic (EPR). Our algorithms are ...
متن کاملAn Integrated Approach for Combining BDDs and SAT Provers
Many formal verification tools today are based on Boolean proof techniques. The two most powerful approaches in this context are Binary Decision Diagrams (BDDs) and methods based on Boolean Satisfiability (SAT). Recent studies have shown that BDDs and SAT are orthogonal, i.e. there exist problems where BDDs work well, while SAT solvers fail and vice versa. Beside this, the techniques are very d...
متن کامل